- degenerate tuple
- вырожденный кортеж, нулькомпонентный объект данных
English-Russian electronics dictionary .
degenerate tuple
Смотреть что такое "degenerate tuple" в других словарях:
Apollonian circles — Some Apollonian circles. Every blue circle intersects every red circle at a right angle. Every red circle passes through the two points, C and D, and every blue circle separates the two points. This article discusses a family of circles sharing a … Wikipedia
Relational algebra — Not to be confused with Relation algebra. Relational algebra, an offshoot of first order logic (and of algebra of sets), deals with a set of finitary relations (see also relation (database)) that is closed under certain operators. These operators … Wikipedia
Milnor number — In mathematics, and particularly singularity theory, the Milnor number, named after John Milnor, is an invariant of a function germ. If f is a complex valued holomorphic function germ then the Milnor number of f, denoted μ(f), is either an… … Wikipedia
probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… … Universalium
Negative multinomial distribution — notation: parameters: k0 ∈ N0 the number of failures before the experiment is stopped, p ∈ Rm m vector of “success” probabilities, p0 = 1 − (p1+…+pm) the probability of a “failure”. support … Wikipedia
MultiDimensional eXpressions — (MDX) is a query language for OLAP databases, much like SQL is a query language for relational databases. It is also a calculation language, with syntax similar to spreadsheet formulas. Contents 1 Background 2 History 2.1 mdXML … Wikipedia
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Abelian variety — In mathematics, particularly in algebraic geometry, complex analysis and number theory, an Abelian variety is a projective algebraic variety that is at the same time an algebraic group, i.e., has a group law that can be defined by regular… … Wikipedia
Dimension table — In data warehousing, a dimension table is one of the set of companion tables to a fact table. The fact table contains business facts or measures and foreign keys which refer to candidate keys (normally primary keys) in the dimension tables.… … Wikipedia
